Binary Forms with Three Different Relative Ranks
نویسنده
چکیده
Suppose f(x, y) is a binary form of degree d with coefficients in a field K ⊆ C. The K-rank of f is the smallest number of d-th powers of linear forms over K of which f is a K-linear combination. We prove that for d ≥ 5, there always exists a form of degree d with at least three different ranks over various fields. The K-rank of a form f (such as x3y2) may depend on whether -1 is a sum of two squares in K.
منابع مشابه
On the typical rank of real binary forms
We determine the rank of a general real binary form of degree d = 4 and d = 5. In the case d = 5, the possible values of the rank of such general forms are 3, 4, 5. The existence of three typical ranks was unexpected. We prove that a real binary form of degree d with d real roots has rank d.
متن کاملEstimation of Binary Infinite Dilute Diffusion Coefficient Using Artificial Neural Network
In this study, the use of the three-layer feed forward neural network has been investigated for estimating of infinite dilute diffusion coefficient ( D12 ) of supercritical fluid (SCF), liquid and gas binary systems. Infinite dilute diffusion coefficient was spotted as a function of critical temperature, critical pressure, critical volume, normal boiling point, molecular volume in normal boilin...
متن کاملRanks of modules relative to a torsion theory
Relative to a hereditary torsion theory $tau$ we introduce a dimension for a module $M$, called {em $tau$-rank of} $M$, which coincides with the reduced rank of $M$ whenever $tau$ is the Goldie torsion theory. It is shown that the $tau$-rank of $M$ is measured by the length of certain decompositions of the $tau$-injective hull of $M$. Moreover, some relations between the $tau$-rank of $M$ and c...
متن کاملEla Binary Ranks and Binary Factorizations of Nonnegative Integer Matrices
Abstract. A matrix is binary if each of its entries is either 0 or 1. The binary rank of a nonnegative integer matrix A is the smallest integer b such that A = BC, where B and C are binary matrices, and B has b columns. In this paper, bounds for the binary rank are given, and nonnegative integer matrices that attain the lower bound are characterized. Moreover, binary ranks of nonnegative intege...
متن کاملBinary ranks and binary factorizations of nonnegative integer matrices
A matrix is binary if each of its entries is either 0 or 1. The binary rank of a nonnegative integer matrix A is the smallest integer b such that A = BC, where B and C are binary matrices, and B has b columns. In this paper, bounds for the binary rank are given, and nonnegative integer matrices that attain the lower bound are characterized. Moreover, binary ranks of nonnegative integer matrices...
متن کامل